Monge sequences and a simple assignment algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for the Detection and Construction of Monge Sequences

We give an efficient algorithm which determines whether a condition due to Hoffman (1963) is satisfied by the cost matrix of a transportation problem. In case the condition is satisfied, our algorithm generates a permutation of the matrix entries *Supported in part by Allon Fellowship and by a Bat Sheva de Rothschild grant. ‘Supported in part by the National Science Foundation under grant ECS-G...

متن کامل

A Simple Randomized Algorithm for the Xed Frequency Assignment Problem

In this paper, we deal with the xed frequency assignment problem, using for this purpose the classical theoretical cellular model. We give a simple randomized algorithm, based on the construction of a solution using a \dynamic" tree. Then, performances of this algorithm are evaluated with those obtained by well-known heuristics in terms of quality solutions and computation time.

متن کامل

Detecting cryptically simple protein sequences using the SIMPLE algorithm

MOTIVATION Low-complexity or cryptically simple sequences are widespread in protein sequences but their evolution and function are poorly understood. To date methods for the detection of low complexity in proteins have been directed towards the filtering of such regions prior to sequence homology searches but not to the analysis of the regions per se. However, many of these regions are encoded ...

متن کامل

A Honey Bee Algorithm To Solve Quadratic Assignment Problem

Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1986

ISSN: 0166-218X

DOI: 10.1016/0166-218x(86)90045-4